Software piracy is a damaging and important moral issue, which is widely believed to be unchecked in particular areas of the globe. This cross-cultural study examines differences in morality and behavior toward software piracy in Singapore versus the United States, and reviews the cultural histories of Asia versus the United States to explore why these differences occur. The paper is based upon pilot data collected in the U.S. and Singapore, using a tradeoff analysis methodology and analysis. The data reveal some (...) fascinating interactions between the level of ethical transgression and the rewards or consequences which they produce. (shrink)

We propose a signaling pathway in which cell‐extracellular matrix (ECM) adhesion components PINCH‐1 and kindlin‐2 sense mechanical signals from ECM and link them to proline biosynthesis, a vital metabolic pathway for macromolecule synthesis, redox balance, and ECM remodeling. ECM stiffening promotes PINCH‐1 expression via integrin signaling, which suppresses dynamin‐related protein 1 (DRP1) expression and mitochondrial fission, resulting in increased kindlin‐2 translocation into mitochondria and interaction with Δ1‐pyrroline‐5‐carboxylate (P5C) reductase 1 (PYCR1). Kindlin‐2 interaction with PYCR1 protects the latter from proteolytic degradation, (...) leading to elevated PYCR1 level. Additionally, PINCH‐1 promotes P5C synthase (P5CS) expression and P5C synthesis, which, together with increased PYCR1 level, support augmented proline biosynthesis. This signaling pathway is frequently activated in fibrosis and cancer, resulting in increased proline biosynthesis and excessive collagen matrix production, which in turn further promotes ECM stiffening. Targeting this signaling pathway, therefore, may provide an effective strategy for alleviating fibrosis and cancer progression. (shrink)

We study the relationship between effective domination properties and the bounded jump. We answer two open questions about the bounded jump: We prove that the analogue of Sacks jump inversion fails for the bounded jump and the wtt-reducibility. We prove that no c.e. bounded high set can be low by showing that they all have to be Turing complete. We characterize the class of c.e. bounded high sets as being those sets computing the Halting problem via a reduction with use (...) bounded by an ω-c.e. function. We define several notions of a c.e. set being effectively dominant, and show that together with the bounded high sets they form a proper hierarchy. (shrink)

In this paper we show that there is a pair of superhigh r.e. degree that forms a minimal pair. An analysis of the proof shows that a critical ingredient is the growth rates of certain order functions. This leads us to investigate certain high r.e. degrees, which resemble ∅′ very closely in terms of ∅′-jump traceability. In particular, we will construct an ultrahigh degree which is cappable.

Semi-hyperhypersimple c.e. sets, also known as diagonals, were introduced by Kummer. He showed that by considering an analogue of hyperhypersimplicity, one could characterize the sets which are the Halting problem relative to arbitrary computable numberings. One could also consider half of splittings of maximal or hyperhypersimple sets and get another variant of maximality and hyperhypersimplicity, which are closely related to the study of automorphisms of the c.e. sets. We investigate the Turing degrees of these classes of c.e. sets. In particular, (...) we show that the analogue of a theorem of Martin fails for these classes. (shrink)

This paper begins with a contrast between two different views about whether the five sensory consciousnesses are accompanied by vikalpa. For the Abhidharmakośa, the five sensory consciousnesses are accompanied by the svabhāva-vikalpa whose nature is vitarka; but for Yogācāra, the five sensory consciousnesses are without that particular kind of svabhāva-vikalpa because vitarka is regarded as belonging merely to the mental consciousness. My hypothesis for explaining such difference is that Yogācāra assigns that particular kind of svabhāva-vikalpa to mental consciousness rather than (...) to the five sensory consciousnesses. I then look for possible functions of vitarka-vicāra that could map to svabhāva-vikalpa: (a) conceptual vitarka-vicāra in an unconcentrated state; (b) conceptual vitarka-vicāra in a concentrated state; (c) nonconceptual vitarka-vicāra in an unconcentrated state; (d) non-conceptual vitarka-vicāra in a concentrated state. I argue that the svabhāva-vikalpa in the Abhidharmakośa should map to (c) and (d), which in Yogācāra maps to mental perception (mānasapratyakṣa) stipulated by Dignāga. This refers to the discernment of the shape of a cognitive object in the foreground against the background. I end this paper with some general observations about why Yogācāra maps the svabhāvavikapla to the mental consciousness, and about the different senses covered by the Buddhist notion of vikalpa, which is broader than the sense of "conceptualization" as we now understand it. (shrink)

_Buddhist Philosophy of Consciousness_ explores a variety of different approaches to the study of consciousness developed by Buddhist philosophers in classical India and China. It addresses questions that are still being investigated in cognitive science and philosophy of mind.

Understanding the meaning of a sentence is crucial for Buddhists because they put so much emphasis on understanding the verbal expressions of the Buddha. But this can be problematic under their metaphysical framework of momentariness, and their epistemological framework of multiple consciousnesses. This paper starts by reviewing the theory of five states of mind in the Yogācārabhūmi, and then investigates debates among medieval East Asian Yogācāra thinkers about how various consciousnesses work together to understand the meaning of a sentence. The (...) major differences between the various explanations proffered lie in the minimum number of types of consciousnesses involved, and the minimum linguistic marks cognized, in order for one to understand a sentence consisting of four Chinese characters. I show that in these disputes, two points are key: First, the role played by the mental consciousness that arises simultaneously with a sensory consciousness: that is to say, whether a sensory consciousness should still be regarded as essential for understanding, if the simultaneous mental consciousness also cognizes the same mark. Second, whether the syntactic structure of a sentence is taken into consideration: that is to say, whether there is a separate determination of understanding regarding each character, or there is no determination until one has heard two or more characters and takes them as a syntactically meaningful unit. (shrink)

This study examines the extent to which business students from Canada, Japan, Hong Kong, and Taiwan react differently to ethical dilemmas involving employees, supervisors, customers, suppliers, and business rivals. The empirical results show that the national origin of the students does have an impact on their reactions to particular ethical dilemmas. In addition, the results indicate that controlling for the problem of social desirability response bias is important to ensure the validity of the empirical findings.

This dissertation argues that the Yogâcāra Buddhism transmitted by the Indian translator Paramârtha (Ch. Zhendi 真諦) underwent a significant transformation due to the influence of his later Chinese interpreters, a phenomenon to which previous scholars failed to paid enough attention. I begin with showing two contrary interpretations of Paramârtha’s notion of jiexing 解性. The traditional interpretation glosses jiexing in terms of “original awakening” (benjue 本覺) in the Awakening of Faith and hence betrays its strong tie to that text. In contrast, (...) a contrary interpretation of jiexing is preserved in a Dunhuang fragment Taishō No. 2805 (henceforth abbreviated as T2805). The crucial part of this dissertation consists in demonstrating that T2805 and the Awakening of Faith represent two competing lineages of the interpreters of Paramârtha. The first clue is that modern scholars have voiced objection to the traditional attribution of the Awakening of Faith to Paramârtha. In addition, I discovered that striking similarities exist between T2805 and Paramârtha’s corpus with respect to terminology, style of phrasing, and doctrine. I further draw attention to the historical testimonies about two different doctrinal views held by Paramârtha’s interpreters. Therefore, I argue that there were two lineages in the name of Paramârtha’s disciples around 590 CE: the indirect lineage interpreted Paramârtha through the lens of the Awakening of Faith; and the direct lineage—represented by T2805—preserved Paramârtha’s original teachings but died out prematurely. Later Chinese Buddhist tradition mistakenly regards the indirect lineage as Paramârtha’s true heir and attributes the Awakening of Faith to Paramârtha. This implies that Paramârtha may have agreed with Xuanzang 玄奘 (600-664) much more than scholars used to assume. For example, Xuanzang’s characterization of the notion of “aboriginal uncontaminated seeds” looks very similar to how Paramârtha depicts jiexing. It also implies that we should distinguish the strong sense of the notion of “tathāgatagarbha” in the Awakening of Faith from its weak sense. The fact that even Vasubandhu endorses the weak sense of “tathāgatagarbha” strongly challenges the received wisdom that Yogâcāra and Tathāgatagarbha were two distinct and antagonistic trends of thought in India. (shrink)

It is important to understand the processes behind how and why individuals emerge as leaders, so that the best and most capable individuals may occupy leadership positions. So far, most literature in this area has focused on individual characteristics, such as personality or cognitive ability. While interactions between individuals and context do get research attention, we still lack a comprehensive understanding of how the social context at work may help individuals to emerge as leaders. Such knowledge could make an important (...) contribution toward getting the most capable, rather than the most dominant or narcissistic individuals, into leadership positions. In the present work, we contribute toward closing this gap by testing a mediation chain linking a leader's leader self-awareness to a follower's leadership emergence with two time-lagged studies (nstudy1 = 449, nstudy2 = 355). We found that the leader's leader self-awareness was positively related to (a) the follower's leadership emergence and (b) the follower's nomination for promotion and that both relationships were serially mediated by the follower's self-leadership and the follower's leader self-efficacy. We critically discuss our findings and provide ideas for future research. (shrink)

Haydon White’s Metahistory interprets representations of history as inherently reflecting historians’ subjectivity. That is, the modes in which historians represent history are significantly determined and grounded by their ideological commitments. In this article, I offer a metahistorical analysis of the modes of doing history undertaken by the African Islamic intellectual historians Ousmane Kane and Souleymane Bachir Diagne. I critically evaluate the consistency between the object of history as they assume it to be and the discourses they produce, taking account of (...) their ideologically grounded mode of realizing their chosen object of history. Taking the general object of history for the African intellectual to be the resistance of the colonial library, I argue that, in their pursuit of this object of history, Kane and Diagne fall short owing to their use of the Islamic library to assert the existence of an African intellectual history. (shrink)

This study evidences turn actions done by ellipsis marks-only turns and blank turns as employed in quasisynchronous chats that are not discussed in prior literature. A brief introduction to the research background of ellipsis marks in online chats is followed by a description of the data collected before delving into the actions done by ellipsis marks-only turns and blank turns. Data were culled from multi-party chats among tertiary students during a critical reasoning class. A Conversation Analysis-informed approach is applied in (...) this article to analyze the preference organization of elliptical turns that illustrate several turn actions which include responses signaling disagreement, confusion and disapproval besides initial actions of eliciting responses and holding the floor. More than punctuation marks or paralinguistic restitution of silences, their interpersonal meaningfulness in sequential context and differentness/similarity vis-a-vis temporal silences are demonstratively shown in microscopic and interpretive description of chat excerpts. (shrink)

This paper advocates learned in the religious context of liberation, the "theology," a concept can be reasonably applied to religious traditions other than Christianity. According to that "beyond the world community and how the phenomenon of contact" as a general theological issues, and Consciousness-only school of Buddhism, one of the major literature of the "photo Mahayana theory of" how to respond to this issue. In the "photo Mahayana theory" in this issue of "inaction of the Dharma Realm to save sentient (...) beings in the phenomenal world and promising" in the form of presentation. This stands for "photo Mahayana theory" to this problem, but through three Buddha body of theory. In short, the body of law to the Buddha Dharma and sentient beings as a contact intermediary. On the one hand, body of law as a Buddha in the phenomenal world to attend the results, which do not transcend the phenomenal world; other hand, the body of law were no wisdom to properly recognize the judicial system, and therefore associated with the Dharma Realm. Further, the body of law can not smell, good enough for practical enlightenment through the body of living beings must engage with the changes in the body, while the body of law and the relationship between the other two, is equivalent to no difference between the intellect and wisdom after that relationship. Finally, the "photo Mahayana theory" liberation school structure and Christianity's "Christology" of relief to make a simple comparison study architecture, and as a conclusion. This paper begins with arguing that within the larger context of soteriology, the notion of "theology" can be legitimately applied to other religious traditions than Christianity. Following this, I propose that the issue of how the realm of transcendence could relate to the realm of phenomenon can serve as an example of a general theological issue across religious boundaries. I then investigate how this issue is discussed in the Mahāyānasamgraha as a seminal text in the Buddhist Yogācāra tradition. In the Mahāyānasamgraha, the above issue is formulated as the question of how unconditioned Dharma-realm could save the sentient beings in the conditioned world. I argue that the asnwer provided in the Mahāyānasamgraha hinges on its theory of three bodies of the Buddha. In short, the Dharma-body bridges between the Dharma-realm and sentient beings. On the one hand, the Dharma-body is the result of a bodhisattva's enduring practice in the phenomenal world, and hence does not transcend over the phenomenal world; on the other hand, the Dharma-body correctly knows the Dharma- realm through the non-discriminating cognition , and hence relates to the Dharma-realm. Furthermore, since sentient beings cannot see the Dharma-body, they can be taught only by the Enjoyment-body and the Transformation-body of the Buddha. The relation between the Dharma-body and the other two bodies is identical to the relation between the non-discriminating cognition and the subsequently-acquired cognition . Finally, this paper ends with a brief comparison between the soteriological scheme in the Mahāyānasamgraha and the scheme reflected in the issue of Christology. (shrink)

We show that for every intermediate \ s-degree there exists an incomparable \ s-degree. As a consequence, for every intermediate \ Q-degree there exists an incomparable \ Q-degree. We also show how these results can be applied to provide proofs or new proofs of upper density results in local structures of s-degrees and Q-degrees.

Why do logicians develop so many different philosophical logics? All their aims focus on the same question--”What is logic?” Whether they have said it is the aim question which they want answer or not when they are doing logics, this is the presumed motivation for all studies of logics. In other words, the reason for logicians to do logics is try to answer what logic is. This kind of conceptual analysis on logic is the main problem style to be asked (...) in Universal Logic, such as “What is classical propositional logic?”, “What is many‐valued logic?”, “What is paraconsistent logic?”, etc. In this paper, we discuss one of Béziau’s paradoxes, Translation Paradox in Logical Translation, due to this kind of conceptual analysis on logic. Universal Logic is not a new logic, according to Béziau, it is a general theory of logical structures analogy to Universal Algebra, even if we could see it as a new logical activity. It is not to find out a ‘universal’ logic to cover all aims of logical researches. And it is definitely not in the spirit of logical monism, that is there is only one true logic. Develop Universal Logic about 15 years, besides its own motivation and purposes, it increasingly induces to two main stream problems, one is Logical Translation and the other is Combination of Logics which are two new realms in logic research. We find it is an easier way to start with Béziau’s Translation Paradox to get involved into Translation of Logics. (shrink)

This study provides an overview of social media usage among researchers in Malaysia and examines factors affecting their use for science communication. The online questionnaire gathered the opinions of 425 researchers from over 20 science disciplines. The descriptive analysis highlighted usage preferences for 10 commonly used social media, while statistical analysis in particular MANOVA and correlation analysis, identified significant factors influencing researchers’ social media use. Up to 62% of respondents believe that social media is more effective in reaching the public, (...) compared to other media. WhatsApp, Facebook, YouTube, Google Scholar, and ResearchGate are routinely used or perceived as beneficial to use. However, Twitter, Instagram, WordPress, and LinkedIn are seldom used because they are less preferred for science communication. Seniority, perceived importance, and perceived credibility are significantly correlated with both intention and actual use. Meanwhile, age and experience are significantly correlated with actual use, but not the intention. Researchers are likely to post and share more on social media if they believe that science communication is important or if they are credible enough to present a scientific consensus. This study offered important insights into the perceptions, concerns, and factors influencing their use for science communication. By determining the perceptions, concerns and motivators affecting researchers, the findings shed light on effective ways to promote researchers’ use of social media to communicate scientific knowledge. (shrink)

The extant literature has largely conceptualized abusive supervision as a hot and impulsive form of aggression. In this paper, we offer a cold and strategic perspective on how abusive supervision might be used strategically to achieve goals. Drawing on the Machiavellian literature and social interaction theory of aggression, we develop a moderated serial mediation model, in which leader Machiavellianism predicts their strategic use of abusive supervision on subordinates via the mediating role of leaders’ guanxi with direct supervisor. We further theorize (...) that this mediation effect is more pronounced when guanxi among team members (team member guanxi, TMG) is stronger, because Mach leaders are more likely to perceive high TMG as a threat to their power. Finally, we propose that Mach leaders’ strategic use of abusive supervision has negative implications for team outcomes, manifested in low levels of team voice and team organizational citizenship behaviors toward fellow team members (OCBI). Analyses of two studies—Study 1 using multi-wave data (355 leaders) from a US sample and Study 2 using a multi-wave, multi-source, and multilevel data (1252 subordinates and 273 leaders) from a Chinese sample—corroborated our model. This study provides a comprehensive examination of who, how, and when strategic abuse unfolds in the workplace and its negative implication for team outcomes. (shrink)

Understanding the development and practice of power based on an in-depth observation of human psychology has been a part of traditional Chinese thought for thousands of years and is considered a prerequisite for mastering the arts of strategy and leadership. "Thunder in the Sky" presents two secret classics of this ancient Chinese tradition. The commentary by Thomas Cleary the renowned translator of dozens of Asian classics highlights the contemporary application of these teachings.

Implicit morality theories refer to people’s beliefs about whether individuals’ moral character is fixed or malleable. Drawing on the social cognitive theory of morality, we examine the relationship between employees’ implicit morality theories and their organizational citizenship behaviors toward coworkers (OCBC) and coworker-directed deviance (CDD) through a moral self-regulatory mechanism. A laboratory experiment (Study 1), an online experiment (Study 2), and a multi-wave, multi-source field survey (Study 3) found that the more employees held a fixed belief about morality, the lower (...) their sense of moral control, especially when their moral identity was lower. This perceived lack of moral control, in turn, predicted decreased OCBC, particularly when the workgroup ethical climate was weak. However, this relationship did not hold for CDD. Overall, our research highlights implicit morality theories as a novel antecedent of employees’ workplace behaviors, and identifies the underlying moral self-regulatory process, along with individual and situational boundary conditions. (shrink)

We show that there is a cuppable c.e. degree, all of whose cupping partners are high. In particular, not all cuppable degrees are${\operatorname {\mathrm {low}}}_3$-cuppable, or indeed${\operatorname {\mathrm {low}}}_n$cuppable for anyn, refuting a conjecture by Li. On the other hand, we show that one cannot improve highness to superhighness. We also show that the${\operatorname {\mathrm {low}}}_2$-cuppable degrees coincide with the array computable-cuppable degrees, giving a full understanding of the latter class.

A strong degree of categoricity is a Turing degree [Formula: see text] such that there is a computable structure [Formula: see text] that is [Formula: see text]-computably categorical (there is a [Formula: see text]-computable isomorphism between any two computable copies of [Formula: see text]), and such that there exist two computable copies of [Formula: see text] between which every isomorphism computes [Formula: see text]. The question of whether every [Formula: see text] degree is a strong degree of categoricity has been (...) of interest since the first paper on this subject. We answer the question in the affirmative, by constructing an example. (shrink)

We study the Turing degrees which contain a real of effective packing dimension one. Downey and Greenberg showed that a c.e. degree has effective packing dimension one if and only if it is not c.e. traceable. In this paper, we show that this characterization fails in general. We construct a real $A\leq_T\emptyset''$ which is hyperimmune-free and not c.e. traceable such that every real $\alpha\leq_T A$ has effective packing dimension 0. We construct a real $B\leq_T\emptyset'$ which is not c.e. traceable such (...) that every real $\alpha\leq_T B$ has effective packing dimension 0. (shrink)

Guided by Basic Psychological Need Theory, we investigated the combined associations between need satisfaction and need frustration and their relations with theoretically relevant correlates including mindfulness, physical literacy, physical activity enjoyment, and physical activity. The participants were Singapore-based school students who completed a cross-sectional survey. The results of the latent profile analysis identified four distinct need profiles: profile 1–average satisfaction and frustration ; profile 2–low satisfaction, above average frustration; profile 3–very high satisfaction, very low frustration ; and profile 4–high satisfaction, (...) very high frustration. Among these, profile 3 was the most adaptive one; it had the highest levels of mindfulness, physical literacy, physical activity enjoyment, and moderate-to-vigorous physical activity. Experiences of need satisfaction countered the negative effects of need frustration on these correlates. These findings enhance our understanding of students’ psychological need experiences and highlight the need for investigating the combined associations between need satisfaction and need frustration. (shrink)

We introduce a natural strengthening of prompt simplicity which we call strong promptness, and study its relationship with existing lowness classes. This notion provides a ≤ wtt version of superlow cuppability. We show that every strongly prompt c.e. set is superlow cuppable. Unfortunately, strong promptness is not a Turing degree notion, and so cannot characterize the sets which are superlow cuppable. However, it is a wtt-degree notion, and we show that it characterizes the degrees which satisfy a wtt-degree notion very (...) close to the definition of superlow cuppability. Further, we study the strongly prompt c.e. sets in the context of other notions related promptness, superlowness, and cupping. In particular, we show that every benign cost function has a strongly prompt set which obeys it, providing an analogue to the known result that every cost function with the limit condition has a prompt set which obeys it. We also study the effect that lowness properties have on the behaviour of a set under the join operator. In particular we construct an array noncomputable c.e. set whose join with every low c.e. set is low. (shrink)

We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relationsR,S, a componentwise reducibility is defined byR≤S⇔ ∃f∀x, y[x R y↔fS f].Here,fis taken from a suitable class of effective functions. For us the relations will be on natural numbers, andfmust be computable. We show that there is a${\rm{\Pi }}_1^0$-complete equivalence relation, but no${\rm{\Pi }}_k^0$-complete fork≥ 2. We show that${\rm{\Sigma }}_k^0$preorders arising naturally in the above-mentioned areas are${\rm{\Sigma }}_k^0$-complete. This includes polynomial timem-reducibility on (...) exponential time sets, which is${\rm{\Sigma }}_2^0$, almost inclusion on r.e. sets, which is${\rm{\Sigma }}_3^0$, and Turing reducibility on r.e. sets, which is${\rm{\Sigma }}_4^0$. (shrink)

We study computable Polish spaces and Polish groups up to homeomorphism. We prove a natural effective analogy of Stone duality, and we also develop an effective definability technique which works up to homeomorphism. As an application, we show that there is a $\Delta ^0_2$ Polish space not homeomorphic to a computable one. We apply our techniques to build, for any computable ordinal $\alpha $, an effectively closed set not homeomorphic to any $0^{}$-computable Polish space; this answers a question of Nies. (...) We also prove analogous results for compact Polish groups and locally path-connected spaces. (shrink)

We examine the sequences A that are low for dimension, i.e. those for which the effective dimension relative to A is the same as the unrelativized effective dimension. Lowness for dimension is a weakening of lowness for randomness, a central notion in effective randomness. By considering analogues of characterizations of lowness for randomness, we show that lowness for dimension can be characterized in several ways. It is equivalent to lowishness for randomness, namely, that every Martin-Löf random sequence has effective dimension (...) 1 relative to A, and lowishness for K, namely, that the limit of KA/K is 1. We show that there is a perfect [Formula: see text]-class of low for dimension sequences. Since there are only countably many low for random sequences, many more sequences are low for dimension. Finally, we prove that every low for dimension is jump-traceable in order nε, for any ε > 0. (shrink)

A structure is automatic if its domain, functions, and relations are all regular languages. Using the fact that every automatic structure is decidable, in the literature many decision problems have been solved by giving an automatic presentation of a particular structure. Khoussainov and Nerode asked whether there is some way to tell whether a structure has, or does not have, an automatic presentation. We answer this question by showing that the set of Turing machines that represent automata-presentable structures is ${\rm{\Sigma (...) }}_1^1 $-complete. We also use similar methods to show that there is no reasonable characterisation of the structures with a polynomial-time presentation in the sense of Nerode and Remmel. (shrink)

We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions based on classical notions in the literature. We relate these notions with the well-established definitions of effective presentability for discrete and profinite groups, and compare our results with similar results in computable topology.

We explore the complexity of Sacks’ Splitting Theorem in terms of the mind change functions associated with the members of the splits. We prove that, for any c.e. set A, there are low computably enumerable sets $A_0\sqcup A_1=A$ splitting A with $A_0$ and $A_1$ both totally $\omega ^2$ -c.a. in terms of the Downey–Greenberg hierarchy, and this result cannot be improved to totally $\omega $ -c.a. as shown in [9]. We also show that if cone avoidance is added then there (...) is no level below $\varepsilon _0$ which can be used to characterize the complexity of $A_1$ and $A_2$. (shrink)

ObjectivesWomen who underwent chemotherapy for metastatic breast cancer used both adaptive and maladaptive coping strategies but had low implementation levels. The present study explores the qualitative experience of coping strategies for women with MBC undergoing CT in Beijing.MethodsA hermeneutic phenomenological approach was employed on twenty Chinese MBC women undergoing CT. These interviews were transcribed verbatim, coded using thematic analysis, and analyzed using NVivo 11.ResultsThree themes are highlighted: Maintaining hope; Spiritual growth, and Self-perceived support resources.ConclusionThe present study results have led to (...) a greater understanding of the tremendous impact of CT on MBC women’s lives. This research provides insight into the scope of maintaining hope. Spiritual growth and self-perceived support resources were crucial factors to coping strategies among MBC women to improve their quality of life.Clinical RelevanceBy attaining the adaptive coping strategies and further understanding about Chinese MBC women, health care professionals are encouraged to appraise MBC women’s specific problems and adopt effective interventions to improve MBC women’s psychosocial wellbeing. (shrink)

We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results from effective descriptive set theory and recursion theory. In fact it is essential to extend several prominent results in recursion theory (e.g. the Shore-Slaman Join Theorem) to the setting of Polish spaces. As a by-product we give both positive and negative results on (...) the Martin Conjecture on the degree preserving Borel functions between Polish spaces. Additionally we prove results about the transfinite version as well as the computable version of the Decomposability Conjecture. (shrink)

We prove a number of results in effective randomness, using methods in which Π⁰₁ classes play an essential role. The results proved include the fact that every PA Turing degree is the join of two random Turing degrees, and the existence of a minimal pair of LR degrees below the LR degree of the halting problem.

We study for each computably bounded $\Pi ^0_1$ class P the set of degrees of c.e. paths in P. We show, amongst other results, that for every c.e. degree a there is a perfect $\Pi ^0_1$ class where all c.e. members have degree a. We also show that every $\Pi ^0_1$ set of c.e. indices is realized in some perfect $\Pi ^0_1$ class, and classify the sets of c.e. degrees which can be realized in some $\Pi ^0_1$ class as exactly (...) those with a computable representation. (shrink)

The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations R and S on natural numbers, R is computably reducible to S if there is a computable function f:ω→ω that induces an injective map from R-equivalence classes to S-equivalence classes. In order to compare the complexity of equivalence relations which are computable, researchers considered also feasible variants of computable reducibility, such as the polynomial-time reducibility. (...) In this work, we explore Peq, the degree structure generated by primitive recursive reducibility on primitive recursive equivalence relations with infinitely many equivalence classes. In contrast with all other known degree structures on equivalence relations, we show that Peq has much more structure: e.g., we show that it is a dense distributive lattice. On the other hand, we also offer evidence of the intricacy of Peq, proving, e.g., that the structure is neither rigid nor homogeneous. (shrink)

The burgeoning of new technologies is increasingly affecting people’s lives. One new technology that is heatedly discussed is artificial intelligence in education. To allow students to understand the impact of emerging technologies on people’s future lives from a young age, some popular science activities are being progressively introduced into elementary school curricula. Popular science activities are informal education programs and practices of universal education. However, two issues need to be discussed in the implementation of these activities. First, because these informal (...) curricula are usually short in duration, the question of whether they only serve to generate motivation or actually enhance learning outcomes requires examination. Second, the role of teacher support in popular science activities and its impact on students’ learning results need to be further investigated. To this end, this study aims to explore the effectiveness of popular AI science activities in informal curricula on students’ AI achievement and the interrelationship between students’ learning outcomes in popular AI science activities with and without teacher support. A 6-h-long AI popular science activity was conducted with 22 fifth- and sixth-grade students in elementary school. This study was conducted using a one-group pretest and posttest design, and the data collection tools included AI achievement pre- and posttests and an artifact scoring rubric. The results showed that with regard to learning outcomes, popular science activities were helpful for cognitive enhancement of AI concepts, but more time was needed for skills to improve. Additionally, this study found that students’ learning performance was different with and without teacher support. Activities with teacher support can enhance students’ learning outcomes, but students become accustomed to relying on their teachers. In contrast, activities without teacher support seem to be more effective in fostering students’ independent computational thinking and problem-solving abilities. (shrink)

We characterize the linear order types $\tau $ with the property that given any countable linear order $\mathcal {L}$, $\tau \cdot \mathcal {L}$ is a computable linear order iff $\mathcal {L}$ is a computable linear order, as exactly the finite nonempty order types.

We solve a problem posed by Goncharov and Knight 639–681, 757]). More specifically, we produce an effective Friedberg enumeration of computable equivalence structures, up to isomorphism. We also prove that there exists an effective Friedberg enumeration of all isomorphism types of infinite computable equivalence structures.

We show that Sacks' and Shoenfield's analogs of jump inversion fail for both tt- and wtt-reducibilities in a strong way. In particular we show that there is a ${\mathrm{\Delta }}_{2}^{0}$ set B > tt ∅′ such that there is no c.e. set A with A′ ≡ wtt B. We also show that there is a ${\mathrm{\Sigma }}_{2}^{0}$ set C > tt ∅′ such that there is no ${\mathrm{\Delta }}_{2}^{0}$ set D with D′ ≡ wtt C.

We study inversions of the jump operator on ${\mathrm{\Pi }}_{1}^{0}$ classes, combined with certain basis theorems. These jump inversions have implications for the study of the jump operator on the random degrees—for various notions of randomness. For example, we characterize the jumps of the weakly 2-random sets which are not 2-random, and the jumps of the weakly 1-random relative to 0′ sets which are not 2-random. Both of the classes coincide with the degrees above 0′ which are not 0′-dominated. A (...) further application is the complete solution of [24, Problem 3.6.9]: one direction of van Lambalgen's theorem holds for weak 2-randomness, while the other fails. Finally we discuss various techniques for coding information into incomplete randoms. Using these techniques we give a negative answer to [24, Problem 8.2.14]: not all weakly 2-random sets are array computable. In fact, given any oracle X, there is a weakly 2-random which is not array computable relative to X. This contrasts with the fact that all 2-random sets are array computable. (shrink)

We describe punctual categoricity in several natural classes, including binary relational structures and mono-unary functional structures. We prove that every punctually categorical structure in a finite unary language is${\text {PA}}(0')$-categorical, and we show that this upper bound is tight. We also construct an example of a punctually categorical structure whose degree of categoricity is$0''$. We also prove that, with a bit of work, the latter result can be pushed beyond$\Delta ^1_1$, thus showing that punctually categorical structures can possess arbitrarily complex (...) automorphism orbits.As a consequence, it follows that binary relational structures and unary structures are not universal with respect to primitive recursive interpretations; equivalently, in these classes every rich enough interpretation technique must necessarily involve unbounded existential quantification or infinite disjunction. In contrast, it is well-known that both classes are universal for Turing computability. (shrink)

This study aims to examine key attributes affecting Airbnb users' satisfaction and dissatisfaction through the analysis of online reviews. A corpus that comprises 59,766 Airbnb reviews form 27,980 listings located in 12 different cities is analyzed by using both Latent Dirichlet Allocation and supervised LDA approach. Unlike previous LDA based Airbnb studies, this study examines positive and negative Airbnb reviews separately, and results reveal the heterogeneity of satisfaction and dissatisfaction attributes in Airbnb accommodation. In particular, the emergence of the topic (...) “guest conflicts” in this study leads to a new direction in future sharing economy accommodation research, which is to study the interactions of different guests in a highly shared environment. The results of topic distribution analysis show that in different types of Airbnb properties, Airbnb users attach different importance to the same service attributes. The topic correlation analysis reveals that home like experience and help from the host are associated with Airbnb users' revisit intention. We determine attributes that have the strongest predictive power to Airbnb users' satisfaction and dissatisfaction through the sLDA analysis, which provides valuable managerial insights into priority setting when developing strategies to increase Airbnb users' satisfaction. Methodologically, this study contributes by illustrating how to employ novel approaches to transform social media data into useful knowledge about customer satisfaction, and the findings can provide valuable managerial implications for Airbnb practitioners. (shrink)

We study the degree structure of the ω-c.e., n-c.e., and Π10 equivalence relations under the computable many-one reducibility. In particular, we investigate for each of these classes of degrees the most basic questions about the structure of the partial order. We prove the existence of the greatest element for the ω-c.e. and n-computably enumerable equivalence relations. We provide computable enumerations of the degrees of ω-c.e., n-c.e., and Π10 equivalence relations. We prove that for all the degree classes considered, upward density (...) holds and downward density fails. (shrink)

In this paper we show that there is no minimal bound for jump traceability. In particular, there is no single order function such that strong jump traceability is equivalent to jump traceability for that order. The uniformity of the proof method allows us to adapt the technique to showing that the index set of the c.e. strongly jump traceables is image-complete.

Since the correct solution to the problem of the relationship between natural science and philosophy is related to the alliance between philosophical workers and natural scientists, it is also related to the development of philosophy and natural science. One of the problems inevitably encountered in solving the problem of the relationship between natural science and philosophy is the materialism of natural science. This article will attempt some theoretical investigation of this problem. Although some of my points may be unsuitable and (...) one-sided, I hope they will be corrected by the natural scientists and philosophical workers. (shrink)